Probabilistic Opaque Quorum Systems
نویسندگان
چکیده
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this paper, we present a family of probabilistic opaque Byzantine quorum systems that require substantially fewer servers. Our analysis is novel in that it assumes Byzantine clients, anticipating that a faulty client may seek quorums that maximize the probability of error. Using this as motivation, we present an optional, novel protocol that allows probabilistic quorum systems to tolerate Byzantine clients. The protocol requires only one additional round of interaction between the client and the servers, and this round may be amortized over multiple operations. We consider actual error probabilities introduced by the probabilistic approach for concrete configurations of opaque quorum systems, and prove that the probability of error vanishes with as few as n > 3.15b servers as n and b grow. This work was partially supported by NSF grant CCF-0424422.
منابع مشابه
Write Markers for Probabilistic Quorum Systems
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probability for a system with enough replicas. However, they are hampered in that, like strict quorum systems, they allow for Byzantine-faulty servers to collude maximally to provide incorrect values to clients. We present a ...
متن کاملProbabilistic quorum systems for dependable distributed data management
Among failure-prone and dynamic distributed systems there is a significant class of systems that strive for high availability and can function with inconsistent data. Examples include flight reservation systems which allow overbooking or emergency ambulance systems which return informative responses to time-critical queries. Data replication is a well-known technique for tolerating failures and...
متن کاملProbabilistic Quorum-Based Accounting for Peer-to-Peer Systems
Providing an effective accounting scheme for decentralized peer-to-peer systems is difficult without relying on a central server or peers with special trusted status. In this paper, we present Probabilistic Quorum-based Accounting (PQA) for peer-to-peer systems. In our approach, a peer receiving a request will retrieve resource usage accounting information about the requesting peer from a quoru...
متن کاملConsistency-Driven Probabilistic Quorum System Construction for Improving Operation Availability
Pessimistic quorum-based data replication strategies generally strive for maximizing operation availabilities while adhering to a strict consistency notion. Unfortunately, their operation availabilities are strictly upper-bounded. Probabilistically relaxing the consistency notion permits to overcome this bound, introducing probabilistic data replication strategies that allow for a data consiste...
متن کاملA Distributed Algorithm for Resource Allocation with Probabilistic Quorum Systems
The resource allocation problem is one of fundamental problems in distributed systems, and many resource models and resource allocation algorithms have been proposed in many literature. In this paper, we consider a problem of allocating a set of unnamed resources that can be overbooked. Such a resource model is suitable for sharing broadband communication channel by many nodes. We propose a ran...
متن کامل